Maximum Coverage Problem with Group Budget Constraints and Applications
نویسندگان
چکیده
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, . . . , Sm} where each set Si is a subset of a given ground set X. In the maximum coverage problem the goal is to pick k sets from S to maximize the cardinality of their union. In the MCG problem S is partitioned into groups G1, G2, . . . , G`. The goal is to pick k sets from S to maximize the cardinality of their union but with the additional restriction that at most one set be picked from each group. We motivate the study of MCG by pointing out a variety of applications. We show that the greedy algorithm gives a 2-approximation algorithm for this problem which is tight in the oracle model. We also obtain a constant factor approximation algorithm for the cost version of the problem. We then use MCG to obtain the first constant factor approximation algorithms for the following problems: (i) multiple depot k-traveling repairmen problem with covering constraints and (ii) orienteering problem with time windows when the number of time windows is a constant.
منابع مشابه
Budget Management and Its Applications
Given a directed acyclic graph with timing constraints, the budget management problem is to assign to each vertex an incremental delay such that the total sum of these delays is maximized without violating given constraints. We propose the notion of slack sensitivity and budget gradient to demonstrate characteristics of budget management. We develop an optimal polynomial-time algorithm for the ...
متن کاملMaximizing submodular set functions subject to multiple linear constraints
The concept of submodularity plays a vital role in combinatorial optimization. In particular, many important optimization problems can be cast as submodular maximization problems, including maximum coverage, maximum facility location and max cut in directed/undirected graphs. In this paper we present the first known approximation algorithms for the problem of maximizing a nondecreasing submodul...
متن کاملA Resource-Constrained Coverage Protocol Over Urban VANETs
Vehicular ad hoc networks have emerged as a promising area of research in academic fields. However, it presents a challenge to design a realistic coverage protocol for vehicular networks, due to the service requirements, assorted mobility patterns, resource constraints and irregularity of the service area. It is also a challenge to meet a high quality of coverage with a tight deployment budget....
متن کاملProfit maximization solid transportation problem under budget constraint using fuzzy measures
Fixed charge solid transportation problems are formulated as profit maximization problems under a budget constraint at each destination. Here item is purchased in different depots at different prices. Accordingly the item is transported to different destinations from different depots using different vehicles. Unitsare sold from different destinations to the customers at different selling prices...
متن کاملA modified NSGA-II solution for a new multi-objective hub maximal covering problem under uncertain shipments
Hubs are centers for collection, rearrangement, and redistribution of commodities in transportation networks. In this paper, non-linear multi-objective formulations for single and multiple allocation hub maximal covering problems as well as the linearized versions are proposed. The formulations substantially mitigate complexity of the existing models due to the fewer number of constraints and v...
متن کامل